#define _CRT_SECURE_NO_WARNINGS 1

#include"sort.h"

int main()
{
	int a[] = { 3,7,0,1,8,6,3,2,10,9 };
	int b[] = { 3,7,0,1,8,6,3,2,10,9 };
	int c[] = { 3,7,0,1,8,6,3,2,10,9 };
	int d[] = { 3,7,0,1,8,6,3,2,10,9 };
	int e[] = { 3,7,0,1,8,6,3,2,10,9 };
	int f[] = { 3,7,0,1,8,6,3,2,10,9 };
	int g[] = { 3,7,0,1,8,6,3,2,10,9 };

	SelectSort(a, sizeof(a) / sizeof(int));
	printf("SelectSort: ");
	Printf(a, sizeof(a) / sizeof(int));

	HeapSort(b, sizeof(b) / sizeof(int));
	printf("HeapSort: ");
	Printf(b, sizeof(b) / sizeof(int));

	BubbleSort(c, sizeof(c) / sizeof(int));
	printf("BubbleSort: ");
	Printf(c, sizeof(c) / sizeof(int));

	QuickSort(d, 0, (sizeof(d) / sizeof(int)) - 1);
	printf("QuickSort: ");
	Printf(d, sizeof(d) / sizeof(int));

	PartSort1(e, 0, (sizeof(e) / sizeof(int)) - 1);
	printf("PartSort1: ");
	Printf(e, sizeof(e) / sizeof(int));

	QuickSort2(f, 0, (sizeof(f) / sizeof(int)) - 1);
	printf("QuickSort2: ");
	Printf(f, sizeof(f) / sizeof(int));

	QuickSort3(g, 0, (sizeof(g) / sizeof(int)) - 1);
	printf("QuickSort3: ");
	Printf(g, sizeof(g) / sizeof(int));

	return 0;
} 